Fixed-parameter tractability and data reduction for multicut in trees
نویسندگان
چکیده
We study an NP-complete (and MaxSNP-hard) communication problem on tree networks, the so-calledMulticut in Trees: given an undirected tree and some pairs of nodes of the tree, find out whether there is a set of at most k tree edges whose removal separates all given pairs of nodes. Multicut has been intensively studied for trees as well as for general graphs mainly from the viewpoint of polynomialtime approximation algorithms. By way of contrast, we provide a simple fixed-parameter algorithm for Multicut in Trees showing ∗Supported by the Deutsche Forschungsgemeinschaft (DFG), Emmy Noether research group PIAF (fixed-parameter algorithms), NI 369/4. Parts of this work have been done while the authors were at the Universität Tübingen.
منابع مشابه
Fixed-Parameter Tractability of Multicut in Directed Acyclic Graphs
The Multicut problem, given a graph G, a set of terminal pairs T = {(si, ti) | 1 ≤ i ≤ r} and an integer p, asks whether one can find a cutset consisting of at most p non-terminal vertices that separates all the terminal pairs, i.e., after removing the cutset, ti is not reachable from si for each 1 ≤ i ≤ r. The fixed-parameter tractability of Multicut in undirected graphs, parameterized by the ...
متن کاملComplexity and Exact Algorithms for Multicut
The Multicut problem is defined as: given an undirected graph and a collection of pairs of terminal vertices, find a minimum set of edges or vertices whose removal disconnects each pair. We mainly focus on the case of removing vertices, where we distinguish between allowing or disallowing the removal of terminal vertices. Complementing and refining previous results from the literature, we provi...
متن کاملExact algorithms and applications for Tree-like Weighted Set Cover
We introduce an NP-complete special case of the Weighted Set Cover problem and show its fixed-parameter tractability with respect to the maximum subset size, a parameter that appears to be small in relevant applications. More precisely, in this practically relevant variant we require that the given collection C of subsets of a some base set S should be “tree-like.” That is, the subsets in C can...
متن کاملParameterized Complexity Dichotomy for Steiner Multicut
We consider the Steiner Multicut problem, which asks, given an undirected graph G, a collection T = {T1, . . . , Tt}, Ti ⊆ V (G), of terminal sets of size at most p, and an integer k, whether there is a set S of at most k edges or nodes such that of each set Ti at least one pair of terminals is in different connected components of G \S. This problem generalizes several well-studied graph cut pr...
متن کاملEdge Disjoint Paths and Multicut Problems in Graphs Generalizing the Trees∗
We generalize all the results obtained for maximum integer multiflow and minimum multicut problems in trees by Garg et al. [Primaldual approximation algorithms for integral flow and multicut in trees. Algorithmica 18 (1997) 3–20] to graphs with a fixed cyclomatic number, while this cannot be achieved for other classical generalizations of the trees. Moreover, we prove that the minimum multicut ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Networks
دوره 46 شماره
صفحات -
تاریخ انتشار 2005